Finite Lattices Do Not Make Reasoning in ALCI Harder
نویسندگان
چکیده
We consider the fuzzy logic ALCI with semantics based on a finite residuated lattice. We show that the problems of satisfiability and subsumption of concepts in this logic are ExpTime-complete w.r.t. general TBoxes and PSpace-complete w.r.t. acyclic TBoxes. This matches the known complexity bounds for reasoning in crisp ALCI.
منابع مشابه
An ABox Abduction Algorithm for the Description Logic ALCI
ABox abduction is the foundation of abductive reasoning in description logics. It finds the minimal sets of ABox axioms which could be added to a background knowledge base to enforce the entailment of certain ABox assertions. In this paper, an abductive reasoning algorithm for the description logic ALCI is presented. The algorithm is an extension of an existing ABox abduction algorithm for the ...
متن کاملFinite Model Reasoning in ALCQI is EXPTIME Logics
Most description logics (DLs) enjoy the finite model property (FMP). This is, for example, the case for ALC [14] and many of its extensions such as ALCI (ALC with inverse roles) and ALCQ (ALC with qualifying number restrictions): for any of these logics L, each satisfiable L-concept has a finite model. This even holds if we consider concept satisfiability w.r.t. general TBoxes. However, there a...
متن کاملFUZZY ORDERED SETS AND DUALITY FOR FINITE FUZZY DISTRIBUTIVE LATTICES
The starting point of this paper is given by Priestley’s papers, where a theory of representation of distributive lattices is presented. The purpose of this paper is to develop a representation theory of fuzzy distributive lattices in the finite case. In this way, some results of Priestley’s papers are extended. In the main theorem, we show that the category of finite fuzzy Priestley space...
متن کاملFuzzy Ontologies over Lattices with T-norms
In some knowledge domains, a correct handling of vagueness and imprecision is fundamental for adequate knowledge representation and reasoning. For example, when trying to diagnose a disease, medical experts need to confront symptoms described by the patient, which are by definition subjective, and hence vague. Moreover, a single malady may present a diversity of clinical manifestations in diffe...
متن کاملInverse Roles Make Conjunctive Queries Hard
Conjunctive query answering is an important DL reasoning task. Although this task is by now quite well-understood, tight complexity bounds for conjunctive query answering in expressive DLs have never been obtained: all known algorithms run in deterministic double exponential time, but the existing lower bound is only an EXPTIME one. In this paper, we prove that conjunctive query answering in AL...
متن کامل